Eecient, Adaptable Implementations of Graph Algorithms
نویسندگان
چکیده
EEciency, exibility, and ease of use are desirable goals in library design. However, these goals seem to contradict each other. The Library of Ecient Algorithms and Data Structures (LEDA) focuses on eeciency and ease of use. On the other hand, we have developed concepts for the implementation of algorithms which focus on eeciency and exibility. In this paper, we present a possible combination of these concepts with LEDA, and we report computational results which estimate the resulting run-time overhead.
منابع مشابه
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
In this paper we describe robust and eecient implementations of two graph connectivity algorithms. The implementations are based on the LEDA library of eecient data types and algorithms 18]. Moreover, we provide experimental evaluations of the implemented algorithms and we compare their performance to other graph connectivity algorithms currently implemented in LEDA. The rst algorithm is the Ka...
متن کاملAlmost All k-Colorable Graphs are Easy to Color
We describe a simple and eecient heuristic algorithm for the graph coloring problem and show that for all k 1, it nds an optimal coloring for almost all k-colorable graphs. We also show that an algorithm proposed by Br elaz and justiied on experimental grounds optimally colors almost all k-colorable graphs. EEcient implementations of both algorithms are given. The rst one runs in O(n+m log k) t...
متن کاملEecient Massively Parallel Implementation of Some Combinatorial Algorithms 1
We describe our implementation of several eecient parallel algorithms on the massively parallel SIMD machine MasPar MP-1 with virtual processing. The MPL language that we used on the MasPar MP-1 does not support virtual processing. In this paper, we describe the implementation of virtual processing for several combi-natorial algorithms using the MPL language. We present our data allocation sche...
متن کاملRanking algorithms for Hamiltonian paths in hypercubic networks
Given a labeled set that is linearly ordered, a ranking algorithm returns the rank-position of an element in the linear order when input with the label of that element. In this paper we provide ranking (and unranking) algorithms for certain classes of graphs where the linear order on the vertex-set of a graph is determined by a Hamiltonian path. The classes of graphs we consider include the Hyp...
متن کاملSome results on ongoing research on parallelimplementation of graph algorithms
In high performance computing, three recognized important points are us-ability, scalability and portability. No models seemed to satisfy these three steps till recently: a few proposed models try to fullll the previous goals. Among them, the BSP-like CGM model seemed adapted to us to facilitate the way between algorithms design and real implementations. Many algorithms have been designed but f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007